General Concepts of Graphs
نویسندگان
چکیده
A little general abstract combinatorial nonsense delivered in this note is a presentation of some old and basic concepts, central to discrete mathematics, in terms of new words. The treatment is from a structural and systematic point of view. This note consists essentially of definitions and summaries.
منابع مشابه
Some Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملBirkhoff's Theorem from a geometric perspective: A simple example
From Hilbert's theorem of zeroes, and from Noether's ideal theory, Birkhoff derived certain algebraic concepts (as explained by Tholen) that have a dual significance in general toposes, similar to their role in the original examples of algebraic geometry. I will describe a simple example that illustrates some of the aspects of this relationship. The dualization from algebra to geometr...
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007